Transform Condit ionals to Polymorphism1

نویسندگان

  • Stéphane Ducasse
  • Oscar Nierstrasz
  • Serge Demeyer
چکیده

Conditionals —i.e., switch statements, nested ifs— that are used to simulate polymorphism hamper evolution and flexibility of applications. The reengineering patterns presented in this paper show you how to transform conditionals in object-oriented code to improve the flexibility of application. This work has been funded by the Swiss Government under Project no. NFS-2000-46947.96 and BBW-96.0015 as well as by the European Union under the ESPRIT program Project no. 21975 (FAMOOS). Copyright 2000 by Serge Demeyer, Stéphane Ducasse, Oscar Nierstrasz A revised version of these patterns is published in: Serge Demeyer, Stéphane Ducasse, Oscar Nierstrasz, Object-Oriented Reengineering Patterns, Morgan Kaufmann, 2002. www.iam.unibe.ch/~scg/OORP

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Postulates for Conditional Belief Revision

In this paper, we present a scheme of postulates for revising epistemic states by condit ional beliefs. These postulates are supported mainly by fol lowing the specific, non-classical nature of conditionals, and the aim of preserving condi t ional beliefs is achieved by studying specific interactions between conditionals, represented properly by two relations. Because one of the postulates clai...

متن کامل

Machine performance and condition monitoring using motor operating parameters through artificial intelligence techniques

Condit ion m onitoring (CM) of gearboxes is a necessary act ivit y due to the crucial im portance of gearboxes in power t ransm ission in m ost indust rial applicat ions. There has long been pressure to im prove m easuring techniques and develop analyt ical tools for early fault detect ion in gearboxes. This thesis develops new gearbox m onitoring m ethods by dem onst rat ing that operat ing pa...

متن کامل

Hartley transforms over finite fields

A general f ramework is presented for constructing transforms in the field of the input which have a convolutionlike property. The construction is carried out over finite fields, but is shown to be valid over the real and complex fields as well. It is shown that these basefield transforms can be v iewed as “projections” of the discrete Fourier transform @IT) and that they exist for all lengths ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999